KIT REPORT 110 Preferential Default Description Logics
نویسندگان
چکیده
This report is based on the default integration for Description Logics (DL) presented by Quantz and Royer at KR’92. We specify the general framework for Preferential Default Description Logics (PDDL), and present various alternative PDDL, addressing issues like implicit objects, priorization between defaults, and maximization of default application. We show that all PDDL satisfy the formal properties of system P (Kraus, Lehman and Magidor) and that j Σ, which is based on a priority ordering on multisets of defaults and motivated by an application in Natural Language Processing, even satisfies Rational Monotonicity. Finally, we show paralles between PDDL and Ryan’s Ordered Theory Presentations.
منابع مشابه
An HPSG Parser Based on Description Logics
In this paper I present a parser based on Description Logics (DL) for a German HPSG-style fragment. The specified parser relies mainly on the inferential capabilities of the underlying DL system. Given a preferential default extension for DL disambiguation is achieved by choosing the parse containing a qualitatively minimal number of exceptions.
متن کاملVariable-Strength Conditional Preferences for Matchmaking in Description Logics
We present an approach to variable-strength conditional preferences for matchmaking and ranking objects in description logics. In detail, we introduce conditional preference bases, which consist of a description logic knowledge base and a finite set of variable-strength conditional preferences, and which are associated with a formal semantics based on ranking functions. We then define the notio...
متن کاملA Tableaux Calculus for KLM Preferential and Cumulative Logics
We present tableaux calculi for some logics of default reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableaux proof procedure for preferential logic P and for loop-cumulative logic CL. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. Moreover, they give a decision procedure for the respective logics and can be used to establish th...
متن کاملAnalytic Tableaux for KLM Preferential and Cumulative Logics
We present tableau calculi for some logics of default reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for preferential and cumulative logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. Moreover, they give a decision procedure for the respective logics and can be used to establish their complexity.
متن کاملOn the Non-Monotonic Description Logic $\mathcal{ALC}$+T$_{\mathsf{min}}$
In the last 20 years many proposals have been made to incorporate non-monotonic reasoning into description logics, ranging from approaches based on default logic and circumscription to those based on preferential semantics. In particular, the non-monotonic description logic ALC+Tmin uses a combination of the preferential semantics with minimization of a certain kind of concepts, which represent...
متن کامل